Computing some distance functions between polygons
نویسندگان
چکیده
We present algorithms for computing some distance functions between two (possibly intersecting) polygons, both in the convex and nonconvex cases. The interest for such distance functions comes from applications in robot vision, pattern recognition and contour fitting. We present a linear sequential algorithm and an optimal EREW·PRAM parallel algorithm for the case when the input polygons are convex, and an essentially quadratic sequential algorithm for t.he case of arbitrary polygons (possibly with holes).
منابع مشابه
Common Edges in Rooted Trees and Polygonal Triangulations
Rotation distance between rooted binary trees measures the degree of similarity of two trees with ordered leaves and is equivalent to edge-flip distance between triangular subdivisions of regular polygons. There are no known polynomial-time algorithms for computing rotation distance. Existence of common edges makes computing rotation distance more manageable by breaking the problem into smaller...
متن کاملCyclic schedules for r irregularly occurring events
In connection with railway scheduling problems Guldan [6] considered the problem to place Y regular polygons on a circle such that the minimum distance between two neighbouring vertices becomes as large as possible. This corresponds to the situation that trains which arrive in constant intervals at some railway station are scheduled such that the safety interval between two trains is as large a...
متن کاملpolygons. J. Algorithms, 6(2):213–224, 1985.
[2] B. Bhattacharya and R. Benkoczi. On computing the optimal bridge between two convex polygons. [7] H. Edelsbrunner. Computing the extreme distances between two convex polygons. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons.
متن کاملPolygon scheduling
Consider a set of circles of the same length and r irregular polygons with vertices on a circle of this length. Each of the polygons has to be arranged on a given subset of all circles and the positions of the polygon on the different circles are depending on each other. How should the polygons be arranged relative to each other to minimize some criterion function depending on the distances bet...
متن کاملComputing the Fréchet Distance Between Polygons with Holes
We study the problem of computing the Fréchet distance between subsets of Euclidean space. Even though the problem has been studied extensively for 1-dimensional curves, very little is known for d-dimensional spaces, for any d ≥ 2. For general polygons in R, it has been shown to be NP-hard, and the best known polynomial-time algorithm works only for polygons with at most a single puncture [Buch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 24 شماره
صفحات -
تاریخ انتشار 1991